A Coinductive Confluence Proof for Infinitary Lambda-Calculus
نویسنده
چکیده
We present a new coinductive proof of confluence of Böhm reduction in infinitary lambda-calculus. The proof is simpler than previous proofs of this result. The technique of the proof is new, i.e., it is not merely a coinductive reformulation of any earlier proofs.
منابع مشابه
Coinductive Techniques in Infinitary Lambda-Calculus
The main aim of this paper is to promote a certain informal but rigorous style of doing coinductive proofs, similar to inductive proofs as commonly done by mathematicians. For this purpose we develop a theory which may serve as a reasonably direct justification for coinductive proofs written in this informal style, i.e., converting an informal coinductive proof into a non-coinductive argument m...
متن کاملStandardization for the Coinductive Lambda-Calculus
In the calculus Λ of possibly non-wellfounded λ-terms, standardization is proved for a parallel notion of reduction. For this system confluence has recently been established by means of a bounding argument for the number of reductions provoked by the joining function which witnesses the confluence statement. Similarly, bounds have to be introduced in order to turn the proof of standardization f...
متن کاملAn Extensional Böhm Model
We show the existence of an infinitary confluent and normalising extension of the finite extensional lambda calculus with beta and eta. Besides infinite beta reductions also infinite eta reductions are possible in this extension, and terms without head normal form can be reduced to bottom. As corollaries we obtain a simple, syntax based construction of an extensional Böhm model of the finite la...
متن کاملWeakening the Axiom of Overlap in Infinitary Lambda Calculus
In this paper we present a set of necessary and sufficient conditions on a set of lambda terms to serve as the set of meaningless terms in an infinitary bottom extension of lambda calculus. So far only a set of sufficient conditions was known for choosing a suitable set of meaningless terms to make this construction produce confluent extensions. The conditions covered the three main known examp...
متن کاملConfluence of the coinductive [lambda]-calculus
The coinductive λ-calculus Λ arises by a coinductive interpretation of the grammar of the standard λ-calculus Λ and contains non-wellfounded λ-terms. An appropriate notion of reduction is analyzed and proven to be confluent by means of a detailed analysis of the usual Tait/MartinLöf style development argument. This yields bounds for the lengths of those joining reduction sequences that are guar...
متن کامل